Randomized algorithm - PDFSEARCH.IO - Document Search Engine

Randomized algorithm
Results: 630

#	Item
461	Characterizing the Sample Complexity of Private Learners∗ Amos Beimel Kobbi Nissim Uri Stemmer Add to Reading List Source URL: privacytools.seas.harvard.edu Language: English - Date: 2014-07-01 20:06:57 Statistical inference Applied probability Data privacy Exponential mechanism Randomized algorithm Statistical hypothesis testing Sample size determination Probably approximately correct learning PP Theoretical computer science Statistics Computational complexity theory
462	Private Empirical Risk Minimization, Revisited Raef Bassily∗ Adam Smith∗ † Abhradeep Thakurta‡ Add to Reading List Source URL: privacytools.seas.harvard.edu Language: English - Date: 2014-07-01 19:35:05 Analysis of algorithms Convex analysis Data privacy Operations research Mathematical optimization Loss function Lipschitz continuity Randomized algorithm Exponential mechanism Theoretical computer science Applied mathematics Mathematics
463	Mathematics and computing RAVINDRAN KANNAN Microsoft Research Labs., India e-mail: [removed] The interaction of computing and mathematics Add to Reading List Source URL: www.ias.ac.in Language: English - Date: 2010-02-23 07:06:41 Operations research Analysis of algorithms Convex optimization Linear programming Randomized algorithm Ellipsoid method NP Time complexity Ravi Kannan Theoretical computer science Applied mathematics Computational complexity theory
464	Efficient Pseudorandom Functions From the Decisional Linear Assumption and Weaker Variants Allison B. Lewko ∗ University of Texas at Austin Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2009-10-16 13:57:22 Pseudorandomness Computational hardness assumptions Pseudorandom number generators Algorithmic information theory Pseudorandom generator Naor-Reingold Pseudorandom Function Decisional Diffie–Hellman assumption Pseudorandom function family Randomized algorithm Cryptography Theoretical computer science Applied mathematics
465	NIST SP[removed], Randomized Hashing for Digital Signatures Add to Reading List Source URL: csrc.nist.gov Language: English - Date: 2012-02-09 13:45:25 Public-key cryptography Preimage attack Hash function Digital Signature Algorithm Collision Digital signature Crypt Collision attack SHA-2 Cryptography Cryptographic hash functions Hashing
466	Approximation Algorithms (ADM III) Add to Reading List Source URL: www.coga.tu-berlin.de Language: English - Date: 2012-12-12 06:04:13 NP-complete problems Combinatorial optimization Graph coloring Probabilistic complexity theory Algorithms Semidefinite programming Randomized algorithm Approximation algorithm Randomized rounding Theoretical computer science Mathematics Applied mathematics
467	The Power of Recourse for Online MST and TSP Nicole Megow1 , Martin Skutella1? , Jos´e Verschae2?? , and Andreas Wiese3? ? ? 1 3 Add to Reading List Source URL: www.coga.tu-berlin.de Language: English - Date: 2012-11-23 03:19:45 Analysis of algorithms Operations research Spanning tree Online algorithms Minimum spanning tree Amortized analysis Travelling salesman problem Competitive analysis Randomized algorithm Theoretical computer science Computational complexity theory Mathematics
468	Chapter 5: Random Sampling and Randomized Rounding of Linear Programs (cp. Williamson & Shmoys, Chapter 5) Add to Reading List Source URL: www.coga.tu-berlin.de Language: English - Date: 2012-12-07 05:55:26 Combinatorial optimization Computational complexity theory Analysis of algorithms NP-complete problems Algorithms Linear programming relaxation Randomized rounding Randomized algorithm Maximum cut Theoretical computer science Applied mathematics Mathematics
469	Chapter 5: Random Sampling and Randomized Rounding of Linear Programs (cp. Williamson & Shmoys, Chapter 5) Add to Reading List Source URL: www.coga.tu-berlin.de Language: English - Date: 2012-11-28 07:15:06 NP-complete problems Combinatorial optimization Analysis of algorithms Logic in computer science Time complexity Boolean satisfiability problem Randomized algorithm Algorithm Maximum satisfiability problem Theoretical computer science Applied mathematics Computational complexity theory
470	Chapter 6: Randomized Rounding of Semidefinite Programs (cp. Williamson & Shmoys, Chapter[removed] Add to Reading List Source URL: www.coga.tu-berlin.de Language: English - Date: 2012-12-12 06:05:34 Operations research NP-complete problems Combinatorial optimization Mathematical optimization Graph coloring Semidefinite programming Approximation algorithm Randomized algorithm Randomized rounding Theoretical computer science Mathematics Applied mathematics

UPDATE